Spanning tree

Results: 445



#Item
151CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 A note on α-drawable k-trees David Bremner∗ Jonathan Lenchner†

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 A note on α-drawable k-trees David Bremner∗ Jonathan Lenchner†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:07:22
152Arbre couvrant minimal (Minimum spanning tree) CSI2510 Structures de données et algorithmes

Arbre couvrant minimal (Minimum spanning tree) CSI2510 Structures de données et algorithmes

Add to Reading List

Source URL: www.site.uottawa.ca

Language: French - Date: 2013-11-22 15:31:51
    153CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Network Design Subject to Facility Location J. Bhadury∗, R. Chandrasekaran†, L. Gewali‡ Abstract

    CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Network Design Subject to Facility Location J. Bhadury∗, R. Chandrasekaran†, L. Gewali‡ Abstract

    Add to Reading List

    Source URL: www.cccg.ca

    Language: English - Date: 2004-01-08 18:44:36
    154The Euclidean k-Supplier Problem Viswanath Nagarajan1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NYComputer Science Department, Technion, Haifa 32000, Israel

    The Euclidean k-Supplier Problem Viswanath Nagarajan1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NYComputer Science Department, Technion, Haifa 32000, Israel

    Add to Reading List

    Source URL: www.cs.technion.ac.il

    Language: English - Date: 2012-10-26 12:29:22
    155CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli†

    CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli†

    Add to Reading List

    Source URL: 2011.cccg.ca

    Language: English - Date: 2011-08-06 04:11:16
    156Function and Form in Networks of Interacting Agents

    Function and Form in Networks of Interacting Agents

    Add to Reading List

    Source URL: www.complex-systems.com

    Language: English - Date: 2012-09-20 14:36:17
    157The min-# problem, a hybrid error criterion for near-linear time performance Lilian Buzer∗† Abstract 2.1

    The min-# problem, a hybrid error criterion for near-linear time performance Lilian Buzer∗† Abstract 2.1

    Add to Reading List

    Source URL: www.cccg.ca

    Language: English - Date: 2005-07-31 13:55:46
    158Efficient Graph-Based Image Segmentation Pedro F. Felzenszwalb Artificial Intelligence Lab, Massachusetts Institute of Technology Daniel P. Huttenlocher Computer Science Department, Cornell University

    Efficient Graph-Based Image Segmentation Pedro F. Felzenszwalb Artificial Intelligence Lab, Massachusetts Institute of Technology Daniel P. Huttenlocher Computer Science Department, Cornell University

    Add to Reading List

    Source URL: cs.brown.edu

    Language: English - Date: 2015-04-07 21:33:37
    159CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi†

    CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi†

    Add to Reading List

    Source URL: www.cccg.ca

    Language: English - Date: 2011-08-15 18:22:15
    160Distributed Computing FS 2011 Prof. R. Wattenhofer Barbara Keller

    Distributed Computing FS 2011 Prof. R. Wattenhofer Barbara Keller

    Add to Reading List

    Source URL: dcg.ethz.ch

    Language: English - Date: 2014-09-26 08:28:47